منابع مشابه
User-Irrepressible Sequences
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol sequence periodically, and sends a packet whenever the bit is equal to one. It is assumed that any two or more packets overlapping in time result in a collision, and the collided packets are unrecoverable. Due to the ...
متن کاملTelling Lies: The Irrepressible Truth?
Telling a lie takes longer than telling the truth but precisely why remains uncertain. We investigated two processes suggested to increase response times, namely the decision to lie and the construction of a lie response. In Experiments 1 and 2, participants were directed or chose whether to lie or tell the truth. A colored square was presented and participants had to name either the true color...
متن کاملNew User-Irrepressible Protocol Sequences
Protocol sequences are binary and periodic sequences used for deterministic multiple access in a collision channel without feedback. In this paper, we focus on user-irrepressible (UI) protocol sequences that can guarantee a positive individual throughput per sequence period with probability one for a slot-synchronous channel, regardless of the delay offsets among the users. As the sequence peri...
متن کاملIrrepressible: An Interview with Mark Ptashne
While winter storms crippled almost every state fromWisconsin to Florida, our own force of nature blew into California in January in the compact human form of Mark Ptashne (Fig 1). Mark, who holds the Ludwig Chair of Molecular Biology at Sloan-Kettering in New York, had arrived to give a series of seminars on the West Coast. And if that weren’t enough, he also came prepared for a soirée, with h...
متن کاملPartially user-irrepressible sequence sets and conflict-avoiding codes
In this paper we give a partial shift version of user-irrepressible sequence sets and conflict-avoiding codes. By means of disjoint difference sets, we obtain an infinite number of such user-irrepressible sequence sets whose lengths are shorter than known results in general. Subsequently, the newly defined partially conflict-avoiding codes are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1977
ISSN: 0028-0836,1476-4687
DOI: 10.1038/269198a0